Complexity of constraint satisfaction

Results: 53



#Item
31Software engineering / Constraint satisfaction / Complexity of constraint satisfaction / Local consistency / Mathematical optimization / Spatial–temporal reasoning / Combinatorial optimization / Linear programming / Logic programming / Constraint programming / Theoretical computer science / Applied mathematics

Dr. Manuel Bodirsky Curriculum Vitae Born December 30, 1976, in Freiburg im Breisgau, Germany. German citizenship. Married with Michaela Metzger, three children: Lewin Bodirsky, born April 25, 2006.

Add to Reading List

Source URL: www.lix.polytechnique.fr

Language: English - Date: 2014-02-07 06:50:56
32Workflow / Systems engineering / Management / Computing / Constraint satisfaction / Complexity of constraint satisfaction / Constraint programming / Local consistency / Constraint

Microsoft PowerPoint - cover-IEEE- An Event-model for Constraint-based Person-centric Flows.ppt [Kompatibilitätsmodus]

Add to Reading List

Source URL: www.iaas.uni-stuttgart.de

Language: English - Date: 2015-01-26 07:44:58
33Mathematical logic / Constraint satisfaction / Complexity of constraint satisfaction / Function / Entailment / Envelope / Horn clause / Constraint programming / Logic / Mathematics

Tractable Set Constraints

Add to Reading List

Source URL: ijcai.org

Language: English - Date: 2011-06-29 07:09:50
34Applied mathematics / Local consistency / Constraint satisfaction problem / Constraint satisfaction / NP-complete / Computational complexity theory / NP / P versus NP problem / Complexity of constraint satisfaction / Theoretical computer science / Constraint programming / Complexity classes

The Complexity of Reasoning with Global Constraints Christian Bessiere LIRMM, CNRS/U. Montpellier Montpellier, France [removed]

Add to Reading List

Source URL: www.cse.unsw.edu.au

Language: English - Date: 2006-09-13 04:55:34
35Artificial intelligence / Local consistency / Constraint satisfaction problem / Constraint satisfaction / Constraint inference / Decomposition method / Complexity of constraint satisfaction / Constraint programming / Software engineering / Computer programming

Artificial Intelligence[removed]–156 Decomposable constraints ✩ Ian Gent a , Kostas Stergiou b,∗ , Toby Walsh c a APES Research Group, School of Computer Science, University of St Andrews, Scotland, UK b APE

Add to Reading List

Source URL: www.cse.unsw.edu.au

Language: English - Date: 2006-01-21 00:51:04
36Artificial intelligence / Constraint logic programming / Local consistency / Constraint satisfaction problem / Constraint satisfaction / Structure / Answer set programming / Valuation / Complexity of constraint satisfaction / Constraint programming / Software engineering / Computer programming

Under consideration for publication in Theory and Practice of Logic Programming 1 arXiv:1007.4114v1 [cs.LO] 23 Jul 2010

Add to Reading List

Source URL: www.cse.unsw.edu.au

Language: English - Date: 2010-12-17 06:32:10
37Computing / Computer programming / Operations research / Mathematical optimization / Constraint satisfaction / Economic model / Agent-based model / Computational complexity theory / Abstraction / Constraint programming / Software engineering / Programming paradigms

Synthesis and Abstraction of Constraint Models for Hierarchical Resource Allocation Problems Alexander Schiendorfer, Jan-Philipp Stegh¨ofer, and Wolfgang Reif Institute of Software & Systems Engineering, Augsburg Univer

Add to Reading List

Source URL: www.isse.uni-augsburg.de

Language: English - Date: 2014-12-01 09:23:11
38Combinatorial optimization / NP-complete problems / Computational complexity theory / Approximation algorithm / Maximum cut / Cut / Constraint programming / Constraint satisfaction problem / Theoretical computer science / Graph theory / Mathematics

Robust Approximation of CSPs V´ıctor Dalmau (joint work with A. Krokhin) Universitat Pompeu Fabra Robust Approximation of CSPs – p. 1/3

Add to Reading List

Source URL: www.fields.utoronto.ca

Language: English - Date: 2011-08-15 16:22:53
39Constraint programming / Constraint satisfaction problem / Orbifold

On the complexity of #CSP Martin Dyer University of Leeds Fields Institute

Add to Reading List

Source URL: www.fields.utoronto.ca

Language: English - Date: 2011-08-15 11:39:00
40Constraint programming / Graph coloring / NP-complete problems / Constraint satisfaction problem / Bipartite graph / Graph / Complexity of constraint satisfaction / Path decomposition / Graph theory / Mathematics / Theoretical computer science

Exploiting Bipartiteness to Identify Yet Another Tractable Subclass of CSP Marcus Bjareland? Peter Jonsson?? Dept. of Comp. and Info. Sci. Linkopings universitet

Add to Reading List

Source URL: www.ida.liu.se

Language: English - Date: 2012-01-24 05:34:39
UPDATE